Zero-sum sequential games with incomplete information

Sequential Games with Incomplete Information

Consider the following strategy profile, in which 1 plays a, and 2 plays L. This is a Nash equilibrium. Because there are no subgames, this is also a subgame-perfect Nash equilibrium. But it is a silly equilibrium, because if 2 ever found herself in a situation where she has to move, she would want to play R no matter what her beliefs regarding where she is “inside” that information set. [There...

Solving two-person zero-sum repeated games of incomplete information

In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versus carefully concealing their information so as not to give up a long-term informed advantage. The theory of infinitelyrepeated two-player zero-sum games with incomplete information has been carefully studied, beginning...

Repeated Games Non - Zero - Sum of Incomplete

Using or hiding private information? An experimental study of zero-sum repeated games with incomplete information

This paper studies the value of private information in strictly competitive interactions in which there is a trade-off between (i) the short-run gain of using information, and (ii) the long-run gain of concealing it. We implement simple examples from the class of zero-sum repeated games with incomplete information. While the empirical value of information does not always coincide with the theor...

Evaluating Information in Zero-Sum Games with Incomplete Information on Both Sides

In a Bayesian game some players might receive a noisy signal regarding the specific game actually being played before it starts. We study zero-sum games where each player receives a partial information about his own type and no information about that of the other player, and analyze the impact the signals have on the payoffs. It turns out that the functions that evaluate the value of informatio...